Evaluation of Computational Grammar Formalisms for Indian Languages
نویسندگان
چکیده
Natural Language Parsing has been the most prominent research area since the genesis of Natural Language Processing. Probabilistic Parsers are being developed to make the process of parser development much easier, accurate and fast. In Indian context, identification of which Computational Grammar Formalism is to be used is still a question which needs to be answered. In this paper we focus on this problem and try to analyze different formalisms for Indian languages.
منابع مشابه
Grammar Checkers for Natural Languages: a Review
Natural Language processing is an interdisciplinary branch of linguistic and computer science studied under the Artificial Intelligence (AI) that gave birth to an allied area called ‘Computational Linguistics’ which focuses on processing of natural languages on computational devices. A natural language consists of many sentences which are meaningful linguistic units involving one or more words ...
متن کاملDescriptional Succinctness of Some Grammatical Formalisms for Natrual Language
We investigate the problem of describing languages compactly in different grammatical formalisms for natural languages. In particular, the problem is studied from the point of view of some newly developed natural language formalisms like linear control grammars (LCGs) and tree adjoining grammars (TAGs); these formalisms not only generate non-context-free languages that capture a wide variety of...
متن کاملTowards Modular Development of Typed Unification Grammars
Development of large-scale grammars for natural languages is a complicated endeavor: Grammars are developed collaboratively by teams of linguists, computational linguists, and computer scientists, in a process very similar to the development of large-scale software. Grammars are written in grammatical formalisms that resemble very-high-level programming languages, and are thus very similar to c...
متن کاملComputational properties of Unification Grammars
There is currently considerable interest among computational linguists in grammatical formalisms with highly restricted generative power. This is based on the argument that a grammar formalism should not merely be viewed as a notation, but as part of the linguistic theory. It is now generally accepted that CFGs lack the generative power needed for this purpose. Unification grammars have the abi...
متن کاملComputational Aspects of Non-Projective Dependency Grammars
Lexicalised Configuration Grammars (lcg) is a declarative framework for non-projective dependency grammars. Lexical entries in lcg are local well-formedness conditions for drawings (trees equipped with a total order). The framework is powerful enough to encode a large number of existing grammar formalisms declaratively. The expressivity of lcg, however, comes at the cost of np-complete word pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1209.1301 شماره
صفحات -
تاریخ انتشار 2012